Norms of structured random matrices

نویسندگان

چکیده

For $m,n\in\mathbb{N}$ let $X=(X_{ij})_{i\leq m,j\leq n}$ be a random matrix, $A=(a_{ij})_{i\leq real deterministic and $X_A=(a_{ij}X_{ij})_{i\leq the corresponding structured matrix. We study expected operator norm of $X_A$ considered as between $\ell_p^n$ $\ell_q^m$ for $1\leq p,q \leq \infty$. prove optimal bounds up to logarithmic terms when underlying matrix $X$ has i.i.d. Gaussian entries, independent mean-zero bounded or $\psi_r$ ($r\in(0,2]$) entries. In certain cases, we determine precise order constants. Our results are expressed through sum norms Hadamard products $A\circ A$ $(A\circ A)^T$.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Structured Random Matrices

Random matrix theory is a well-developed area of probability theory that has numerous connections with other areas of mathematics and its applications. Much of the literature in this area is concerned with matrices that possess many exact or approximate symmetries, such as matrices with i.i.d. entries, for which precise analytic results and limit theorems are available. Much less well understoo...

متن کامل

Some Estimates of Norms of Random Matrices

We show that for any random matrix (Xij) with independent mean zero entries E‖(Xij)‖ ≤ C “ max i sX

متن کامل

Bounding Norms of Locally Random Matrices

Recently, several papers proving lower bounds for the performance of the Sum Of Squares Hierarchy on the planted clique problem have been published. A crucial part of all four papers is probabilistically bounding the norms of certain “locally random” matrices. In these matrices, the entries are not completely independent of each other, but rather depend upon a few edges of the input graph. In t...

متن کامل

Compressive Sensing and Structured Random Matrices

These notes give a mathematical introduction to compressive sensing focusing on recovery using `1-minimization and structured random matrices. An emphasis is put on techniques for proving probabilistic estimates for condition numbers of structured random matrices. Estimates of this type are key to providing conditions that ensure exact or approximate recovery of sparse vectors using `1-minimiza...

متن کامل

Concentration of Norms and Eigenvalues of Random Matrices

In this paper we prove concentration results for norms of rectangular random matrices acting as operators between lp spaces, and eigenvalues of self-adjoint random matrices. Except for the self-adjointness condition when we consider eigenvalues, the only assumptions on the distribution of the matrix entries are independence and boundedness. Our approach is based on a powerful isoperimetric ineq...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematische Annalen

سال: 2023

ISSN: ['1432-1807', '0025-5831']

DOI: https://doi.org/10.1007/s00208-023-02599-6